翻訳と辞書 Words near each other ・ Fixed-Mobile Convergence Alliance ・ Fixed-odds betting ・ Fixed-pattern noise ・ Fixed-point arithmetic ・ Fixed-point combinator ・ Fixed-point index ・ Fixed-point iteration ・ Fixed-point lemma for normal functions ・ Fixed-point property ・ Fixed-point space ・ Fixed-point subgroup ・ Fixed-point subring ・ Fixed-point theorem ・ Fixed-point theorems in infinite-dimensional spaces ・ Fixed-price contract ・ Fixed-priority pre-emptive scheduling ・ Fixed-radius near neighbors ・ Fixed-rate mortgage ・ Fixed-satellite service ・ Fixed-term contract ・ Fixed-term election ・ Fixed-term Parliaments Act 2011 ・ Fixed-term Work Directive ・ Fixed-wing aircraft ・ Fixedsys ・ Fixedsys Excelsior ・ Fixed–mobile convergence ・ Fixem ・ Fixer ・ Fixer (comics) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Fixed-priority pre-emptive scheduling ： ウィキペディア英語版 Fixed-priority pre-emptive scheduling Fixed-priority preemptive scheduling is a scheduling system commonly used in real-time systems. With fixed priority preemptive scheduling, the scheduler ensures that at any given time, the processor executes the highest priority task of all those tasks that are currently ready to execute. The preemptive scheduler has a clock interrupt task that can provide the scheduler with options to switch after the task has had a given period to execute—the time slice. This scheduling system has the advantage of making sure no task hogs the processor for any time longer than the time slice. However, this scheduling scheme is vulnerable to process or thread lockout: since priority is given to higher-priority tasks, the lower-priority tasks could wait an indefinite amount of time. One common method of arbitrating this situation is aging, which gradually increments the priority of waiting processes and threads, ensuring that they will all eventually execute. Most Real-time operating systems (RTOSs) have preemptive schedulers. Also turning off time slicing effectively gives you the non-preemptive RTOS. Preemptive scheduling is often differentiated with cooperative scheduling, in which a task can run continuously from start to end without being preempted by other tasks. To have a task switch, the task must explicitly call the scheduler. Cooperative scheduling is used in a few RTOS such as Salvo or TinyOS. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Fixed-priority pre-emptive scheduling」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.